An isometry plus a nilpotent operator is anm-isometry. Applications
نویسندگان
چکیده
منابع مشابه
Testing Non-isometry Is QMA-Complete
Determining the worst-case uncertainty added by a quantum circuit is shown to be computationally intractable. This is the problem of detecting when a quantum channel implemented as a circuit is close to a linear isometry, and it is shown to be complete for the complexity class QMA of verifiable quantum computation. The main idea is to relate the problem of detecting when a channel is close to a...
متن کاملA Generalized Restricted Isometry Property
Compressive Sampling (CS) describes a method for reconstructing high-dimensional sparse signals from a small number of linear measurements. Fundamental to the success of CS is the existence of special measurement matrices which satisfy the so-called Restricted Isometry Property (RIP). In essence, a matrix satisfying RIP is such that the lengths of all sufficiently sparse vectors are approximate...
متن کاملNorms, Isometries, and Isometry Groups
The study of linear algebra has become more and more popular in the last few decades. People are attracted to this subject because of its beauty and its connections with many other pure and applied areas. In theoretical development of the subject as well as in many applications, one often needs to measure the “length” of vectors. For this purpose, norm functions are considered on a vector space...
متن کاملIsometry of Polish metric spaces
We consider the equivalence relation of isometry of separable, complete metric spaces, and show that any equivalence relation induced by a Borel action of a Polish group on a Polish space is Borel reducible to this isometry relation. We also consider the isometry relation restricted to various classes of metric spaces, and produce lower bounds for the complexity in terms of the Borel reducibili...
متن کاملIsometry groups of combinatorial codes
Two isometry groups of combinatorial codes are described: the group of automorphisms and the group of monomial automorphisms, which is the group of those automorphisms that extend to monomial maps. Unlike the case of classical linear codes, where these groups are the same, it is shown that for combinatorial codes the groups can be arbitrary different. Particularly, there exist codes with the fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2013
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2013.05.043